Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
351	Resettably-Sound Resettable Zero Knowledge Arguments for NP ? Yi Deng State Key Laboratory of Information Security,Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-02-19 03:37:24 Proof theory Applied mathematics Proof of knowledge Deduction Zero-knowledge proof Complexity classes IP Soundness NP Cryptography Mathematics Cryptographic protocols
352	au-restricted4wd-access-map-pg2 Add to Reading List Source URL: www.apollorv.com Language: English - Date: 2015-03-17 02:28:05 Complexity classes NP Rabbit Flat Northern Territory
353	Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-02 11:07:07 Complexity classes Mathematical optimization Structural complexity theory Computational resources P versus NP problem NP-complete Circuit complexity P Time hierarchy theorem Theoretical computer science Computational complexity theory Applied mathematics
354	SAMPLE (For reference only) To: Senior School Development Officer, Regional Education Office ANNUAL SUMMARY OF LEAVE RECORD OF TEACHERSNote Name of School : Period : Add to Reading List Source URL: www.edb.gov.hk Language: English - Date: 2013-05-02 22:48:38 Parenting Parental leave SL Sick leave P Sociology Management Socioeconomics Complexity classes Employment compensation Labor
355	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:49:01 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity NP-complete Vertex cover Time complexity Travelling salesman problem Matching Theoretical computer science Computational complexity theory Applied mathematics
356	Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:19:59 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Feedback vertex set Dominating set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
357	THE COMPLEXITY OF ANALOG COMPUTATION † Anastasios VERGIS Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. Kenneth STEIGLITZ Department of Computer Science, Princeton University, Pr Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-11-25 03:18:59 Complexity classes Mathematical optimization Structural complexity theory Computability theory P versus NP problem NP-complete NP PP Analog computer Theoretical computer science Computational complexity theory Applied mathematics
358	FA11_apps_adm_acc_new.xlsx Add to Reading List Source URL: grad.ucsd.edu Language: English - Date: 2014-10-31 13:42:31 Science Complexity classes NP Healthcare science
359	FA11_apps_adm_acc_new.xlsx Add to Reading List Source URL: grad.ucsd.edu Language: English - Date: 2014-10-31 13:42:31 Applied mathematics Healthcare science Biological engineering Mathematical optimization Computational complexity theory Theoretical computer science Complexity classes NP
360	Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation Hierarchies Tapio Niemi Department of Computer and Information Sciences, University of Tampere FINUniversity of Tampere, Add to Reading List Source URL: sunsite.informatik.rwth-aachen.de Language: English - Date: 2001-06-29 04:41:58 Information technology management Online analytical processing Data Data warehousing Complexity classes Functional dependency Hierarchy Relational model OLAP cube Data management Data modeling Database constraints

UPDATE